<!-- This comment will put IE 6, 7 and 8 in quirks mode -->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>include/shark/Models/Trees/KHCTree.h Source File</title>
<script type="text/javaScript" src="search/search.js"></script>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<script src="https://polyfill.io/v3/polyfill.min.js?features=es6"></script>
<script id="MathJax-script" async src="https://cdn.jsdelivr.net/npm/mathjax@3.0.1/es5/tex-mml-chtml.js"></script>
<script src="../../mlstyle.js"></script>
<link href="../css/besser.css" rel="stylesheet" type="text/css"/>
</head>
<!-- pretty cool: each body gets an id tag which is the basename of the web page  -->
<!--              and allows for page-specific CSS. this is client-side scripted, -->
<!--              so the id will not yet show up in the served source code -->
<script type="text/javascript">
    jQuery(document).ready(function () {
        var url = jQuery(location).attr('href');
        var pname = url.substr(url.lastIndexOf("/")+1, url.lastIndexOf(".")-url.lastIndexOf("/")-1);
        jQuery('#this_url').html('<strong>' + pname + '</strong>');
        jQuery('body').attr('id', pname);
    });
</script>
<body>
    <div id="shark_old">
        <div id="wrap">
            <div id="header">
                <div id="site-name"><a href="../../sphinx_pages/build/html/index.html">Shark machine learning library</a></div>
                <ul id="nav">
                    <li >
                        <a href="../../sphinx_pages/build/html/rest_sources/installation.html">Installation</a>
                    </li>
		    <li >
                        <a href="../../sphinx_pages/build/html/rest_sources/tutorials/tutorials.html">Tutorials</a>
                    </li>
		    <li >
                        <a href="../../sphinx_pages/build/html/rest_sources/benchmark.html">Benchmarks</a>
                    </li>
                    <li class="active">
                        <a href="classes.html">Documentation</a>
                        <ul>
                            <li class="first"></li>
                            <li><a href="../../sphinx_pages/build/html/rest_sources/quickref/quickref.html">Quick references</a></li>
                            <li><a href="classes.html">Class list</a></li>
                            <li class="last"><a href="group__shark__globals.html">Global functions</a></li>
                        </ul>
                    </li>
                </ul>
            </div>
        </div>
    </div>
<div id="doxywrapper">
<!--
    <div id="global_doxytitle">Doxygen<br>Documentation:</div>
-->
    <div id="navrow_wrapper">
<!-- Generated by Doxygen 1.9.8 -->
<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li><li class="navelem"><a class="el" href="dir_9d0c4981f10d03078bcfd5c74fe41ce8.html">shark</a></li><li class="navelem"><a class="el" href="dir_d88670438e31f34fbe7ccda1c525ad9e.html">Models</a></li><li class="navelem"><a class="el" href="dir_e4d868c139b0b9f3574e13422955c5bc.html">Trees</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="headertitle"><div class="title">KHCTree.h</div></div>
</div><!--header-->
<div class="contents">
<a href="_k_h_c_tree_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">//===========================================================================</span><span class="comment"></span></div>
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment">/*!</span></div>
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> * </span></div>
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> *</span></div>
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"> * \brief       Tree for nearest neighbor search in kernel-induced feature spaces.</span></div>
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> * </span></div>
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment"> * </span></div>
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment"> *</span></div>
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment"> * \author      T. Glasmachers</span></div>
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="comment"> * \date        2011</span></div>
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="comment"> *</span></div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="comment"> *</span></div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="comment"> * \par Copyright 1995-2017 Shark Development Team</span></div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="comment"> * </span></div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="comment"> * &lt;BR&gt;&lt;HR&gt;</span></div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="comment"> * This file is part of Shark.</span></div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment"> * &lt;https://shark-ml.github.io/Shark/&gt;</span></div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="comment"> * </span></div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="comment"> * Shark is free software: you can redistribute it and/or modify</span></div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="comment"> * it under the terms of the GNU Lesser General Public License as published </span></div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment"> * by the Free Software Foundation, either version 3 of the License, or</span></div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment"> * (at your option) any later version.</span></div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="comment"> * </span></div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="comment"> * Shark is distributed in the hope that it will be useful,</span></div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span></div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="comment"> * GNU Lesser General Public License for more details.</span></div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="comment"> * </span></div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="comment"> * You should have received a copy of the GNU Lesser General Public License</span></div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="comment"> * along with Shark.  If not, see &lt;http://www.gnu.org/licenses/&gt;.</span></div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="comment"> *</span></div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="comment"> */</span></div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="comment">//===========================================================================</span></div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="preprocessor">#ifndef SHARK_ALGORITHMS_NEARESTNEIGHBORS_KHCTREE_H</span></div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="preprocessor">#define SHARK_ALGORITHMS_NEARESTNEIGHBORS_KHCTREE_H</span></div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="preprocessor">#include &lt;<a class="code" href="_binary_tree_8h.html" title="Binary space-partitioning tree of data points.">shark/Models/Trees/BinaryTree.h</a>&gt;</span></div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="preprocessor">#include &lt;<a class="code" href="_base_8h.html">shark/LinAlg/Base.h</a>&gt;</span></div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="preprocessor">#include &lt;boost/array.hpp&gt;</span></div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceshark.html" title="AbstractMultiObjectiveOptimizer.">shark</a> {</div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="comment"></span> </div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="comment">///</span></div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="comment">/// \brief KHC-tree, a binary space-partitioning tree</span></div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="comment">///</span></div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="comment">/// \par</span></div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="comment">/// KHC-tree data structure for efficient nearest</span></div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="comment">/// neighbor searches in kernel-induced feature</span></div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="comment">/// spaces.</span></div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="comment">/// &quot;KHC&quot; stands for Kernel Hierarchical Clustering.</span></div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="comment">/// The space separation is based on distances to</span></div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="comment">/// cluster centers.</span></div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span><span class="comment">///</span></div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span><span class="comment">/// \par</span></div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="comment">/// The tree is constructed from data by splitting</span></div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span><span class="comment">/// along the pair of data points with largest</span></div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span><span class="comment">/// distance. This quantity is approximated using</span></div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span><span class="comment">/// a given number of randomly sampled pairs, which</span></div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="comment">/// is controlled by the template parameter</span></div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span><span class="comment">/// CuttingAccuracy.</span></div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span><span class="comment">///</span></div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span><span class="comment">/// \par</span></div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span><span class="comment">/// The bucket size for the tree is always one,</span></div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span><span class="comment">/// such that there is a unique point in each leaf</span></div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span><span class="comment">/// cell.</span></div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span><span class="comment">///</span></div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span><span class="comment">///Since the KHCTree needs direct access to the elements, it&#39;s template parameter is not the actual point type</span></div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span><span class="comment">///But the Range, the points are stored in. Be aware that this range should be a View when a Dataset is used as storage,</span></div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span><span class="comment">///since during construction, the KHC-Tree needs random access to the elements.</span></div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span><span class="comment">/// \ingroup space_trees</span></div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span><span class="comment"></span><span class="keyword">template</span> &lt;<span class="keyword">class</span> Container, <span class="keywordtype">int</span> CuttingAccuracy = 25&gt;</div>
<div class="foldopen" id="foldopen00075" data-start="{" data-end="};">
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"><a class="line" href="classshark_1_1_k_h_c_tree.html">   75</a></span><span class="keyword">class </span><a class="code hl_class" href="classshark_1_1_k_h_c_tree.html" title="KHC-tree, a binary space-partitioning tree.">KHCTree</a> : <span class="keyword">public</span> <a class="code hl_class" href="classshark_1_1_binary_tree.html" title="Super class of binary space-partitioning trees.">BinaryTree</a>&lt;typename Container::value_type&gt;</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>{</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span><span class="keyword">public</span>:</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"><a class="line" href="classshark_1_1_k_h_c_tree.html#ad38d5c94143d0fdb8e1c0677edee6a8b">   78</a></span>    <span class="keyword">typedef</span> <a class="code hl_class" href="classshark_1_1_indexed_iterator.html" title="creates an Indexed Iterator, an Iterator which also carries index information using index()">IndexedIterator&lt;typename boost::range_iterator&lt;Container const&gt;::type</a>&gt; <a class="code hl_typedef" href="classshark_1_1_k_h_c_tree.html#ad38d5c94143d0fdb8e1c0677edee6a8b">const_iterator</a>;</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <span class="keyword">typedef</span> <span class="keyword">typename</span> Container::value_type value_type;</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="keyword">typedef</span> <a class="code hl_class" href="classshark_1_1_abstract_kernel_function.html" title="Base class of all Kernel functions.">AbstractKernelFunction&lt;value_type&gt;</a> <a class="code hl_class" href="classshark_1_1_abstract_kernel_function.html" title="Base class of all Kernel functions.">kernel_type</a>;</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="keyword">typedef</span> <a class="code hl_class" href="classshark_1_1_binary_tree.html" title="Super class of binary space-partitioning trees.">BinaryTree&lt;value_type&gt;</a> <a class="code hl_class" href="classshark_1_1_binary_tree.html" title="Super class of binary space-partitioning trees.">base_type</a>;</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span><span class="comment"></span> </div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span><span class="comment">    /// Construct the tree from data.</span></div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span><span class="comment">    /// It is assumed that the container exceeds</span></div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span><span class="comment">    /// the lifetime of the KHCTree (which holds</span></div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span><span class="comment">    /// only references to the points), and that</span></div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span><span class="comment">    /// the memory locations of the points remain</span></div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span><span class="comment">    /// unchanged.</span></div>
<div class="foldopen" id="foldopen00089" data-start="{" data-end="}">
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"><a class="line" href="classshark_1_1_k_h_c_tree.html#a44fbdc20c35370cf39cdaada4bd76620">   89</a></span><span class="comment"></span>    <a class="code hl_function" href="classshark_1_1_k_h_c_tree.html#a44fbdc20c35370cf39cdaada4bd76620">KHCTree</a>(Container <span class="keyword">const</span>&amp; points, <a class="code hl_class" href="classshark_1_1_abstract_kernel_function.html" title="Base class of all Kernel functions.">kernel_type</a> <span class="keyword">const</span>* <a class="code hl_function" href="classshark_1_1_binary_tree.html#a882ac1aea537378fead318573c9b301c">kernel</a>, <a class="code hl_class" href="classshark_1_1_tree_construction.html" title="Stopping criteria for tree construction.">TreeConstruction</a> tc = <a class="code hl_class" href="classshark_1_1_tree_construction.html" title="Stopping criteria for tree construction.">TreeConstruction</a>())</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    : <a class="code hl_class" href="classshark_1_1_binary_tree.html" title="Super class of binary space-partitioning trees.">base_type</a>(points.<a class="code hl_function" href="classshark_1_1_binary_tree.html#aa726e7311191b6617cf2079544e23662">size</a>())</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    , <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#acd6aae2b85d97855361171d95de281b9" title="kernel function">mep_kernel</a>(<a class="code hl_function" href="classshark_1_1_binary_tree.html#a882ac1aea537378fead318573c9b301c">kernel</a>)</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    , <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#a55cfdcc3419ef36d6f4fa2455ebb54ab" title="one divided by squared distance between &quot;positive&quot; and &quot;negative&quot; cluster center">m_normalInvNorm</a>(1.0)</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    {</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        <span class="comment">//create a list to the iterator elements as temporary storage</span></div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        <span class="comment">//we need indexed operators to have a fast lookup of the position of the elements in the container</span></div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        std::vector&lt;const_iterator&gt; elements(<a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#a825e00e68228cb1654b5ac0a25f4972a" title="number of points in this node">m_size</a>);</div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        boost::iota(elements,<a class="code hl_typedef" href="classshark_1_1_k_h_c_tree.html#ad38d5c94143d0fdb8e1c0677edee6a8b">const_iterator</a>(boost::begin(points),0));</div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span> </div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>        <a class="code hl_function" href="classshark_1_1_k_h_c_tree.html#a96ac23e4df78cfa576aae64ba7600b97">buildTree</a>(tc,elements);</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        <span class="comment">//after the creation of the trees, the iterators in the array are sorted in the order,</span></div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        <span class="comment">//they are referenced by the nodes.so we can create the indexList using the indizes of the iterators</span></div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        <span class="keywordflow">for</span>(std::size_t i = 0; i != <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#a825e00e68228cb1654b5ac0a25f4972a" title="number of points in this node">m_size</a>; ++i){</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>            <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#afdce442d41868d9a84dcfc954c78ce93" title="list of indices to points in the dataset">mp_indexList</a>[i] = elements[i].index();</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        }</div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    }</div>
</div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span><span class="comment"></span> </div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span><span class="comment">    /// \par</span></div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span><span class="comment">    /// Compute the squared distance of this cell to</span></div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span><span class="comment">    /// the given reference point, or alternatively</span></div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span><span class="comment">    /// a lower bound on this value.</span></div>
<div class="foldopen" id="foldopen00113" data-start="{" data-end="}">
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"><a class="line" href="classshark_1_1_k_h_c_tree.html#a266d14a6be4ace74d919d7244a967cd8">  113</a></span><span class="comment"></span>    <span class="keywordtype">double</span> <a class="code hl_function" href="classshark_1_1_k_h_c_tree.html#a266d14a6be4ace74d919d7244a967cd8">squaredDistanceLowerBound</a>(value_type <span class="keyword">const</span>&amp; reference)<span class="keyword"> const</span>{</div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>        <span class="keywordtype">double</span> dist = 0.0;</div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>        <a class="code hl_class" href="classshark_1_1_k_h_c_tree.html" title="KHC-tree, a binary space-partitioning tree.">KHCTree</a> <span class="keyword">const</span>* t = <span class="keyword">this</span>;</div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>        <a class="code hl_class" href="classshark_1_1_k_h_c_tree.html" title="KHC-tree, a binary space-partitioning tree.">KHCTree</a> <span class="keyword">const</span>* p = (<a class="code hl_class" href="classshark_1_1_k_h_c_tree.html" title="KHC-tree, a binary space-partitioning tree.">KHCTree</a> <span class="keyword">const</span>*)<a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#a100ef54d8a4904afff8c188bf4e735f9" title="parent node">mep_parent</a>;</div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        <span class="keywordflow">while</span> (p != NULL){</div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>            <span class="keywordtype">double</span> v = p-&gt;distanceFromPlane(reference);</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>            <span class="keywordflow">if</span> (t == p-&gt;<a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#acc95bb731d3bfac4a896820f8de04ad8" title="&quot;right&quot; child node">mp_right</a>)</div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>                v = -v;</div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>            <span class="keywordflow">if</span> (v &gt; dist)</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>                dist = v;</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>            t = p;</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>            p = (<a class="code hl_class" href="classshark_1_1_k_h_c_tree.html" title="KHC-tree, a binary space-partitioning tree.">KHCTree</a> <span class="keyword">const</span>*)p-&gt;<a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#a100ef54d8a4904afff8c188bf4e735f9" title="parent node">mep_parent</a>;</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        }</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        <span class="keywordflow">return</span> (dist * dist);</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    }</div>
</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span> </div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span><span class="keyword">protected</span>:</div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <span class="keyword">using </span><a class="code hl_variable" href="classshark_1_1_binary_tree.html#a100ef54d8a4904afff8c188bf4e735f9" title="parent node">base_type::mep_parent</a>;</div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    <span class="keyword">using </span><a class="code hl_variable" href="classshark_1_1_binary_tree.html#a14c17e4fc65d1351cc23eceae05ce0d0" title="&quot;left&quot; child node">base_type::mp_left</a>;</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    <span class="keyword">using </span><a class="code hl_variable" href="classshark_1_1_binary_tree.html#acc95bb731d3bfac4a896820f8de04ad8" title="&quot;right&quot; child node">base_type::mp_right</a>;</div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    <span class="keyword">using </span><a class="code hl_variable" href="classshark_1_1_binary_tree.html#afdce442d41868d9a84dcfc954c78ce93" title="list of indices to points in the dataset">base_type::mp_indexList</a>;</div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    <span class="keyword">using </span><a class="code hl_variable" href="classshark_1_1_binary_tree.html#a825e00e68228cb1654b5ac0a25f4972a" title="number of points in this node">base_type::m_size</a>;</div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    <span class="keyword">using </span><a class="code hl_variable" href="classshark_1_1_binary_tree.html#ad07d8f306001f8e1bc9a321a3d11444e" title="number of nodes in the sub-tree represented by this node">base_type::m_nodes</a>;</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span><span class="comment"></span> </div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span><span class="comment">    /// (internal) construction of a non-root node</span></div>
<div class="foldopen" id="foldopen00138" data-start="{" data-end="}">
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"><a class="line" href="classshark_1_1_k_h_c_tree.html#a2adecacb10d6e1d61d1d6a626ea22cfd">  138</a></span><span class="comment"></span>    <a class="code hl_function" href="classshark_1_1_k_h_c_tree.html#a2adecacb10d6e1d61d1d6a626ea22cfd" title="(internal) construction of a non-root node">KHCTree</a>(<a class="code hl_class" href="classshark_1_1_k_h_c_tree.html" title="KHC-tree, a binary space-partitioning tree.">KHCTree</a>* <a class="code hl_function" href="classshark_1_1_binary_tree.html#a86cc7ef0387f9ae7cb4aff75cf4c6bee">parent</a>, std::size_t* list, std::size_t <a class="code hl_function" href="classshark_1_1_binary_tree.html#aa726e7311191b6617cf2079544e23662">size</a>)</div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    : <a class="code hl_class" href="classshark_1_1_binary_tree.html" title="Super class of binary space-partitioning trees.">base_type</a>(<a class="code hl_function" href="classshark_1_1_binary_tree.html#a86cc7ef0387f9ae7cb4aff75cf4c6bee">parent</a>, list, <a class="code hl_function" href="classshark_1_1_binary_tree.html#aa726e7311191b6617cf2079544e23662">size</a>)</div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    , <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#acd6aae2b85d97855361171d95de281b9" title="kernel function">mep_kernel</a>(<a class="code hl_function" href="classshark_1_1_binary_tree.html#a86cc7ef0387f9ae7cb4aff75cf4c6bee">parent</a>-&gt;<a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#acd6aae2b85d97855361171d95de281b9" title="kernel function">mep_kernel</a>)</div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    , <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#a55cfdcc3419ef36d6f4fa2455ebb54ab" title="one divided by squared distance between &quot;positive&quot; and &quot;negative&quot; cluster center">m_normalInvNorm</a>(1.0)</div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    { }</div>
</div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span><span class="comment"></span> </div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span><span class="comment">    /// (internal) construction method:</span></div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span><span class="comment">    /// median-cuts of the dimension with widest spread</span></div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span><span class="comment"></span>    <span class="keyword">template</span>&lt;<span class="keyword">class</span> Range&gt;</div>
<div class="foldopen" id="foldopen00147" data-start="{" data-end="}">
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"><a class="line" href="classshark_1_1_k_h_c_tree.html#a96ac23e4df78cfa576aae64ba7600b97">  147</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="classshark_1_1_k_h_c_tree.html#a96ac23e4df78cfa576aae64ba7600b97">buildTree</a>(<a class="code hl_class" href="classshark_1_1_tree_construction.html" title="Stopping criteria for tree construction.">TreeConstruction</a> tc, Range&amp; points){</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        <span class="keyword">typedef</span> <span class="keyword">typename</span> Range::iterator range_iterator;</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span> </div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>        <span class="comment">//check whether we are finished</span></div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>        <span class="keywordflow">if</span> (tc.<a class="code hl_function" href="classshark_1_1_tree_construction.html#abb2b42865b60ddf110e4915ab6457373" title="return maximum depth of the tree">maxDepth</a>() == 0 || <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#a825e00e68228cb1654b5ac0a25f4972a" title="number of points in this node">m_size</a> &lt;= tc.<a class="code hl_function" href="classshark_1_1_tree_construction.html#aa1b255097aa1e7101783b1300b921aad" title="return maximum &quot;size&quot; of a leaf node">maxBucketSize</a>()) {</div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>            <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#ad07d8f306001f8e1bc9a321a3d11444e" title="number of nodes in the sub-tree represented by this node">m_nodes</a> = 1;</div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>            <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>        }</div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span> </div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>        <span class="comment">// use only a subset of size at most CuttingAccuracy</span></div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>        <span class="comment">// to estimate the vector along the longest</span></div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>        <span class="comment">// distance</span></div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#a825e00e68228cb1654b5ac0a25f4972a" title="number of points in this node">m_size</a> &lt;= CuttingAccuracy){</div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>            <a class="code hl_function" href="classshark_1_1_k_h_c_tree.html#a3af2b2683dfe8b119f248e54c1c5d044">calculateNormal</a>(points);</div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>        }</div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>        <span class="keywordflow">else</span>{</div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>            boost::array&lt;const_iterator,CuttingAccuracy&gt; samples;</div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>            <span class="keywordflow">for</span>(std::size_t i = 0; i != CuttingAccuracy; i++)</div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>                samples[i] = points[<a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#a825e00e68228cb1654b5ac0a25f4972a" title="number of points in this node">m_size</a> * (2*i+1) / (2*CuttingAccuracy)];</div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>            <a class="code hl_function" href="classshark_1_1_k_h_c_tree.html#a3af2b2683dfe8b119f248e54c1c5d044">calculateNormal</a>(samples);</div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>        }</div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span> </div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>        <span class="comment">//calculate the distance from the plane for every point in the list</span></div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>        std::vector&lt;double&gt; distance(<a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#a825e00e68228cb1654b5ac0a25f4972a" title="number of points in this node">m_size</a>);</div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>        <span class="keywordflow">for</span>(std::size_t i = 0; i != <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#a825e00e68228cb1654b5ac0a25f4972a" title="number of points in this node">m_size</a>; ++i){</div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>            distance[i] = <a class="code hl_function" href="classshark_1_1_k_h_c_tree.html#a98f61360f2c9a9a6ebc9b9ad995c77a7" title="function describing the separating hyperplane">funct</a>(*points[i]);</div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>        }</div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span> </div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span> </div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>        <span class="comment">// split the list into sub-cells</span></div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>        range_iterator split = this-&gt;<a class="code hl_function" href="classshark_1_1_binary_tree.html#a153a6ecae3dd8bf1407209962febca55">splitList</a>(distance,points);</div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>        range_iterator begin = boost::begin(points);</div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>        range_iterator end = boost::end(points);</div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span> </div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>        <span class="keywordflow">if</span> (split == end) {<span class="comment">//can&#39;t split points.</span></div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>            <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#ad07d8f306001f8e1bc9a321a3d11444e" title="number of nodes in the sub-tree represented by this node">m_nodes</a> = 1;</div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>            <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>        }</div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span> </div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>        <span class="comment">// create sub-nodes</span></div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>        std::size_t leftSize = split-begin;</div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>        <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#a14c17e4fc65d1351cc23eceae05ce0d0" title="&quot;left&quot; child node">mp_left</a> = <span class="keyword">new</span> <a class="code hl_class" href="classshark_1_1_k_h_c_tree.html" title="KHC-tree, a binary space-partitioning tree.">KHCTree</a>(<span class="keyword">this</span>, <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#afdce442d41868d9a84dcfc954c78ce93" title="list of indices to points in the dataset">mp_indexList</a>, leftSize);</div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>        <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#acc95bb731d3bfac4a896820f8de04ad8" title="&quot;right&quot; child node">mp_right</a> = <span class="keyword">new</span> <a class="code hl_class" href="classshark_1_1_k_h_c_tree.html" title="KHC-tree, a binary space-partitioning tree.">KHCTree</a>(<span class="keyword">this</span>, <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#afdce442d41868d9a84dcfc954c78ce93" title="list of indices to points in the dataset">mp_indexList</a> + leftSize, <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#a825e00e68228cb1654b5ac0a25f4972a" title="number of points in this node">m_size</a> - leftSize);</div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span> </div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>        <span class="comment">// recurse</span></div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>        boost::iterator_range&lt;range_iterator&gt; <a class="code hl_function" href="classshark_1_1_binary_tree.html#ae20385cf5cf85d7168db9b3fcf411c47">left</a>(begin,split);</div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>        boost::iterator_range&lt;range_iterator&gt; <a class="code hl_function" href="classshark_1_1_binary_tree.html#ae5167564abb964d90da01897693a5768">right</a>(split,end);</div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>        ((<a class="code hl_class" href="classshark_1_1_k_h_c_tree.html" title="KHC-tree, a binary space-partitioning tree.">KHCTree</a>*)<a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#a14c17e4fc65d1351cc23eceae05ce0d0" title="&quot;left&quot; child node">mp_left</a>)-&gt;buildTree(tc.<a class="code hl_function" href="classshark_1_1_tree_construction.html#aa76f09fabb33889421b6c8f2771afb8a" title="return a TreeConstruction object with maxDepth reduced by one">nextDepthLevel</a>(),<a class="code hl_function" href="classshark_1_1_binary_tree.html#ae20385cf5cf85d7168db9b3fcf411c47">left</a>);</div>
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>        ((<a class="code hl_class" href="classshark_1_1_k_h_c_tree.html" title="KHC-tree, a binary space-partitioning tree.">KHCTree</a>*)<a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#acc95bb731d3bfac4a896820f8de04ad8" title="&quot;right&quot; child node">mp_right</a>)-&gt;buildTree(tc.<a class="code hl_function" href="classshark_1_1_tree_construction.html#aa76f09fabb33889421b6c8f2771afb8a" title="return a TreeConstruction object with maxDepth reduced by one">nextDepthLevel</a>(),<a class="code hl_function" href="classshark_1_1_binary_tree.html#ae5167564abb964d90da01897693a5768">right</a>);</div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>        <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#ad07d8f306001f8e1bc9a321a3d11444e" title="number of nodes in the sub-tree represented by this node">m_nodes</a> = 1 + <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#a14c17e4fc65d1351cc23eceae05ce0d0" title="&quot;left&quot; child node">mp_left</a>-&gt;<a class="code hl_function" href="classshark_1_1_binary_tree.html#a53cb65296bf84a1fbe0715e2ba0878bb" title="number of sub-nodes in this tree (including the node itself)">nodes</a>() + <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#acc95bb731d3bfac4a896820f8de04ad8" title="&quot;right&quot; child node">mp_right</a>-&gt;<a class="code hl_function" href="classshark_1_1_binary_tree.html#a53cb65296bf84a1fbe0715e2ba0878bb" title="number of sub-nodes in this tree (including the node itself)">nodes</a>();</div>
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>    }</div>
</div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span> </div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>    <span class="keyword">template</span>&lt;<span class="keyword">class</span> Range&gt;</div>
<div class="foldopen" id="foldopen00200" data-start="{" data-end="}">
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"><a class="line" href="classshark_1_1_k_h_c_tree.html#a3af2b2683dfe8b119f248e54c1c5d044">  200</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="classshark_1_1_k_h_c_tree.html#a3af2b2683dfe8b119f248e54c1c5d044">calculateNormal</a>(Range <span class="keyword">const</span>&amp; samples){</div>
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>        std::size_t numSamples =<a class="code hl_function" href="namespaceshark.html#af2ab10364feb8a631e0866dcf2f1a4ad">batchSize</a>(samples);</div>
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>        <span class="keywordtype">double</span> best_dist2 = -1.0;</div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>        <span class="keywordflow">for</span> (std::size_t i=1; i != numSamples; i++){</div>
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>            <span class="keywordflow">for</span> (std::size_t j = 0; j != i; j++){</div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>                <span class="keywordtype">double</span> dist2 = <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#acd6aae2b85d97855361171d95de281b9" title="kernel function">mep_kernel</a>-&gt;<a class="code hl_function" href="classshark_1_1_abstract_kernel_function.html#a4526b02196952d7af3bc76633c8bd6b7" title="Computes the squared distance in the kernel induced feature space.">featureDistanceSqr</a>(*samples[i], *samples[j]);</div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>                <span class="keywordflow">if</span> (dist2 &gt; best_dist2){</div>
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>                    best_dist2 = dist2;</div>
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>                    <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#a62c2a26944e5c4d7f6ce9a93208b4956" title="&quot;positive&quot; side cluster center">mep_positive</a> = samples[i];</div>
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>                    <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#a65a65d149ed69d95c9c8782e42cd0226" title="&quot;negative&quot; side cluster center">mep_negative</a> = samples[j];</div>
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>                }</div>
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>            }</div>
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>        }</div>
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>        <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#a55cfdcc3419ef36d6f4fa2455ebb54ab" title="one divided by squared distance between &quot;positive&quot; and &quot;negative&quot; cluster center">m_normalInvNorm</a> = 1.0 / std::sqrt(best_dist2);</div>
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>        <span class="keywordflow">if</span> (! (boost::math::isfinite)(<a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#a55cfdcc3419ef36d6f4fa2455ebb54ab" title="one divided by squared distance between &quot;positive&quot; and &quot;negative&quot; cluster center">m_normalInvNorm</a>))</div>
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>            <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#a55cfdcc3419ef36d6f4fa2455ebb54ab" title="one divided by squared distance between &quot;positive&quot; and &quot;negative&quot; cluster center">m_normalInvNorm</a> = 1.0;</div>
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    }</div>
</div>
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span> </div>
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span> </div>
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span><span class="comment"></span> </div>
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span><span class="comment">    /// function describing the separating hyperplane</span></div>
<div class="foldopen" id="foldopen00221" data-start="{" data-end="}">
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"><a class="line" href="classshark_1_1_k_h_c_tree.html#a98f61360f2c9a9a6ebc9b9ad995c77a7">  221</a></span><span class="comment"></span>    <span class="keywordtype">double</span> <a class="code hl_function" href="classshark_1_1_k_h_c_tree.html#a98f61360f2c9a9a6ebc9b9ad995c77a7" title="function describing the separating hyperplane">funct</a>(value_type <span class="keyword">const</span>&amp; reference)<span class="keyword"> const</span>{</div>
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>        <span class="keywordtype">double</span> result = <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#acd6aae2b85d97855361171d95de281b9" title="kernel function">mep_kernel</a>-&gt;<a class="code hl_function" href="classshark_1_1_abstract_kernel_function.html#abd10e3815efade90c7f9e2a7cc8bcb6c" title="Evaluates the kernel function.">eval</a>(*<a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#a62c2a26944e5c4d7f6ce9a93208b4956" title="&quot;positive&quot; side cluster center">mep_positive</a>, reference);</div>
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>        result -= <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#acd6aae2b85d97855361171d95de281b9" title="kernel function">mep_kernel</a>-&gt;<a class="code hl_function" href="classshark_1_1_abstract_kernel_function.html#abd10e3815efade90c7f9e2a7cc8bcb6c" title="Evaluates the kernel function.">eval</a>(*<a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#a65a65d149ed69d95c9c8782e42cd0226" title="&quot;negative&quot; side cluster center">mep_negative</a>, reference);</div>
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>        result *= <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#a55cfdcc3419ef36d6f4fa2455ebb54ab" title="one divided by squared distance between &quot;positive&quot; and &quot;negative&quot; cluster center">m_normalInvNorm</a>;</div>
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>        <span class="keywordflow">return</span>  result;</div>
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>    }</div>
</div>
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span><span class="comment"></span> </div>
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span><span class="comment">    /// kernel function</span></div>
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"><a class="line" href="classshark_1_1_k_h_c_tree.html#acd6aae2b85d97855361171d95de281b9">  229</a></span><span class="comment"></span>    <a class="code hl_class" href="classshark_1_1_abstract_kernel_function.html" title="Base class of all Kernel functions.">kernel_type</a> <span class="keyword">const</span>* <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#acd6aae2b85d97855361171d95de281b9" title="kernel function">mep_kernel</a>;</div>
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span><span class="comment"></span> </div>
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span><span class="comment">    /// &quot;positive&quot; side cluster center</span></div>
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"><a class="line" href="classshark_1_1_k_h_c_tree.html#a62c2a26944e5c4d7f6ce9a93208b4956">  232</a></span><span class="comment"></span>    <a class="code hl_class" href="classshark_1_1_indexed_iterator.html" title="creates an Indexed Iterator, an Iterator which also carries index information using index()">const_iterator</a> <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#a62c2a26944e5c4d7f6ce9a93208b4956" title="&quot;positive&quot; side cluster center">mep_positive</a>;</div>
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span><span class="comment"></span> </div>
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span><span class="comment">    /// &quot;negative&quot; side cluster center</span></div>
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"><a class="line" href="classshark_1_1_k_h_c_tree.html#a65a65d149ed69d95c9c8782e42cd0226">  235</a></span><span class="comment"></span>    <a class="code hl_class" href="classshark_1_1_indexed_iterator.html" title="creates an Indexed Iterator, an Iterator which also carries index information using index()">const_iterator</a> <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#a65a65d149ed69d95c9c8782e42cd0226" title="&quot;negative&quot; side cluster center">mep_negative</a>;</div>
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span><span class="comment"></span> </div>
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span><span class="comment">    /// one divided by squared distance between &quot;positive&quot; and &quot;negative&quot; cluster center</span></div>
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"><a class="line" href="classshark_1_1_k_h_c_tree.html#a55cfdcc3419ef36d6f4fa2455ebb54ab">  238</a></span><span class="comment"></span>    <span class="keywordtype">double</span> <a class="code hl_variable" href="classshark_1_1_k_h_c_tree.html#a55cfdcc3419ef36d6f4fa2455ebb54ab" title="one divided by squared distance between &quot;positive&quot; and &quot;negative&quot; cluster center">m_normalInvNorm</a>;</div>
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>};</div>
</div>
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span> </div>
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span> </div>
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>}</div>
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span><span class="preprocessor">#endif</span></div>
</div><!-- fragment --></div><!-- contents -->
</div>
</body>
</html>
